Shortcut graphs and groups
نویسندگان
چکیده
We introduce shortcut graphs and groups. Shortcut are in which cycles cannot embed without metric distortion. groups act properly cocompactly on graphs. These notions unify a surprisingly broad family of interest geometric group theory graph theory, including: the 1-skeletons systolic quadric complexes (in particular finitely presented C(6) C(4)-T(4) small cancellation groups), finite dimensional CAT(0) cube complexes, hyperbolic graphs, standard Cayley generated Coxeter Baumslag-Solitar BS(1,2). Most these examples satisfy strong form property. The properties also have important theoretic consequences. show that exponential isoperimetric isodiametric functions. satisfying property polynomial
منابع مشابه
commuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولTHE ORDER GRAPHS OF GROUPS
Let $G$ be a group. The order graph of $G$ is the (undirected)graph $Gamma(G)$,those whose vertices are non-trivial subgroups of $G$ and two distinctvertices $H$ and $K$ are adjacent if and only if either$o(H)|o(K)$ or $o(K)|o(H)$. In this paper, we investigate theinterplay between the group-theoretic properties of $G$ and thegraph-theoretic properties of $Gamma(G)$. For a finite group$G$, we s...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملthe order graphs of groups
let $g$ be a group. the order graph of $g$ is the (undirected)graph $gamma(g)$,those whose vertices are non-trivial subgroups of $g$ and two distinctvertices $h$ and $k$ are adjacent if and only if either$o(h)|o(k)$ or $o(k)|o(h)$. in this paper, we investigate theinterplay between the group-theoretic properties of $g$ and thegraph-theoretic properties of $gamma(g)$. for a finite group$g$, we s...
متن کاملOn Groups and Graphs(1)
By a graph X we mean a finite set V(X), called the vertices of X, together with a set E(X), called the edges of X, consisting of unordered pairs of distinct elements of V(X). We shall indicate the unordered pairs by brackets. Two graphs X and Y are said to be isomorphic, denoted by X cz Y, if there is a one-to-one map a of V(X) onto V(Y) such that [aa,ab~\eE(Y) if and only if [a, b~]eE(X). An i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 2021
ISSN: ['2330-0000']
DOI: https://doi.org/10.1090/tran/8555